Many-to-many Personalized Communication with Bounded Traffic

نویسندگان

  • Sanjay Ranka
  • Ravi V. Shankar
  • Khaled A. Alsabti
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Many-to-many Personalized Communication with Bounded Traac 1 Basic Communication Primitives

This paper presents solutions for the problem of many-to-many personalized communication, with bounded incoming and outgoing traac, on a distributed memory parallel machine. We present a two-stage algorithm that decomposes the many-to-many communication with possibly high variance in message size into two communications with low message size variance. The algorithm is determinis-tic and takes t...

متن کامل

Feature Extraction to Identify Network Traffic with Considering Packet Loss Effects

There are huge petitions of network traffic coming from various applications on Internet. In dealing with this volume of network traffic, network management plays a crucial rule. Traffic classification is a basic technique which is used by Internet service providers (ISP) to manage network resources and to guarantee Internet security. In addition, growing bandwidth usage, at one hand, and limit...

متن کامل

The Transportation Primitive 1 Basic Communication Primitives

This paper presents algorithms for implementing the transportation primitive on a distributed memory parallel architecture. The transportation primitive performs many-to-many personalized communication with bounded incoming and outgoing traac. We present a two-stage deterministic algorithm that decomposes the communication with possibly high variance in message size into two communication stage...

متن کامل

Uncountably many bounded positive solutions for a second order nonlinear neutral delay partial difference equation

In this paper we consider the second order nonlinear neutral delay partial difference equation $Delta_nDelta_mbig(x_{m,n}+a_{m,n}x_{m-k,n-l}big)+ fbig(m,n,x_{m-tau,n-sigma}big)=b_{m,n}, mgeq m_{0},, ngeq n_{0}.$Under suitable conditions, by making use of the Banach fixed point theorem, we show the existence of uncountably many bounded positive solutions for the above partial difference equation...

متن کامل

Fundamental calculus on generalized stochastically bounded bursty traffic for communication networks

Since many applications and networks do not require or provide deterministic service guarantees, stochastic service guarantee analysis is becoming increasingly important and has attracted a lot of research attention in recent years. For this, several stochastic versions of deterministic traffic models have been proposed in the literature. Unlike previous stochastic models that are based on the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015